Branch Prediction of Conditional Nested Loops through an Address Queue
نویسندگان
چکیده
Multi-dimensional applications, such as image processing and seismic analysis, usually require the optimized performance obtained from instruction-level parallelism. The critical sections of such applications consist of nested loops with the possibility of embedded conditional branch instructions. Branch prediction techniques usually require extra hardware, redundancy or do not guarantee the prediction accuracy. This paper shows a new architecture design, able to handle the conditional branches found in nested loops with minimum extra hardware and one hundred percent prediction accuracy. Detailed examples demonstrate the effectiveness of the method.
منابع مشابه
Optimization of SAD Algorithm on VLIW DSP
SAD (Sum of Absolute Difference) algorithm is heavily used in motion estimation which is computationally highly demanding process in motion picture encoding. To enhance the performance of motion picture encoding on a VLIW processor, an efficient implementation of SAD algorithm on the VLIW processor is essential. SAD algorithm is programmed as a nested loop with a conditional branch. In VLIW pro...
متن کاملBounded-Degree Graphs have Arbitrarily Large Queue-Number
We consider graphs possibly with loops but with no parallel edges. A graph without loops is simple. Let G be a graph with vertex set V (G) and edge set E(G). If S ⊆ E(G) then G[S] denotes the spanning subgraph of G with edge set S. We say G is ordered if V (G) = {1, 2, . . . , |V (G)|}. Let G be an ordered graph. Let `(e) and r(e) denote the endpoints of each edge e ∈ E(G) such that `(e) ≤ r(e)...
متن کاملLoop Termination Prediction
Deeply pipelined high performance processors require highly accurate branch prediction to drive their instruction fetch. However there remains a class of events which are not easily predictable by standard two level predictors. One such event is loop termination. In deeply nested loops, loop terminations can account for a significant amount of the mispredictions. We propose two techniques for d...
متن کاملAlgorithm and Hardware Support for Branch Anticipation
Multi-dimensional systems containing nested loops are widely used to model scientific applications such as image processing, geophysical signal processing and fluid dynamics. However, branches within these loops may degrade the performance of pipelined architectures. This paper presents the theory, supporting hardware and experiments of a novel technique, based on multi-dimensional retiming, fo...
متن کاملFuture Branches { beyond Speculative Execution
The performance and hardware complexity of superscalar architectures is hindered by conditional branch instructions. When conditional branches are encountered in a program, the instruction fetch unit must rapidly predict the branch predicate and begin speculatively fetching instructions with no loss of instruction throughput. Speculative execution increases hardware cost, since speculative inst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001